Optimal Path Routing in Partially Connected Wireless Mesh Network
نویسندگان
چکیده
منابع مشابه
A Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملRouting Metrics in Wireless Mesh Network
Routing metrics of multi-hop wireless networks differ from traditional routing metrics due to dynamic and unpredictable nature of wireless media. Many routing metrics were proposed for single-radio as well as multi-radio mesh networks. In this paper we study various routing metrics such as Expected Transmission Count (ETX) metric, Expected Transmission Time (ETT), Weighted cumulative ETT (WCETT...
متن کاملMulti-path Routing Metrics for Reliable Wireless Mesh Routing Topologies
Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of wireless mesh routing topologies, one for flooding and one for unicast routing. The Flooding Path Probability (FPP) metric measures the end-to-end packet deliv...
متن کاملWireless Mesh Network Routing Under Uncertain Demands
Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optim...
متن کاملOptimal Resource Allocation in Wireless Mesh Network
Flow control in a wireless mesh network is an optimization problem. The task is to maximize the aggregate utility of elastic traffic sources. The work has been a basis for analysing various transport-level (including TCP-based) congestion control algorithms. The task takes is to analyse the self-interference of flows and assigns channel, level of transmission power and time slots to each link. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2019
ISSN: 2321-9653
DOI: 10.22214/ijraset.2019.4301